Development and Validation of a Computer‐Administered Number Sense Scale for Fifth‐Grade Children in Taiwan

To investigate the structure of number sense and then to assess its uses in fifth‐grade children's number sense development, a computerized number sense scale was developed and evaluated. The findings of the study indicate that the newly developed scale, with four dominant factors identified and reconfirmed, is internally consistent and substantially valid. It can be reliably used as a screening measure for a quick check of students' number sense development via online self‐assessment. Compared with our previous study, both qualitative and quantitative changes were detected in students' number sense development at different grades. The qualitative change in number sense development is manifested in different numbers of factor components produced at different grades. The quantitative change is manifested in different amounts of factor variance explained at different grades. Furthermore, among the four aspects of number sense, Taiwanese students perform best on recognizing the relative number size yet relatively worse on judging the reasonableness of computational results.     

Coloring axis-parallel rectangles

For every k and r, we construct a finite family of axis-parallel rectangles in the plane such that no matter how we color them with k colors, there exists a point covered by precisely r members of the family, all of which have the same color. For r=2, this answers a question of S. Smorodinsky [S. Smorodinsky, On the chromatic number of some geometric hypergraphs, SIAM J. Discrete Math. 21 (2007) 676-687].     

More on block intersection polynomials and new applications to graphs and block designs

The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy certain integer linear equations involving binomial coefficients, and information on the non-negative integer solutions to these equations can be obtained using the block intersection polynomials introduced by P.J. Cameron and the present author. The theory of block intersection polynomials is extended, and new applications of these polynomials to the studies of graphs and block designs are obtained. In particular, we obtain a new method of bounding the size of a clique in an edge-regular graph with given parameters, which can improve on the Hoffman bound when applicable, and a new method for studying the possibility of a graph with given vertex-degree sequence being an induced subgraph of a strongly regular graph with given parameters.     

Coincidences of projections and linear n-valued maps of tori

We prove that the Nielsen fixed point number N(φ) of an n-valued map φ:X?X of a compact connected triangulated orientable q-manifold without boundary is equal to the Nielsen coincidence number of the projections of the graph of φ, a subset of X×X, to the two factors. For certain q×q integer matrices A, there exist “linear” n-valued maps Φn,A,σ:Tq?Tq of q-tori that generalize the single-valued maps fA:Tq→Tq induced by the linear transformations TA:Rq→Rq defined by TA(v)=Av. By calculating the Nielsen coincidence number of the projections of its graph, we calculate N(Φn,A,σ) for a large class of linear n-valued maps.     

Crosscap numbers of pretzel knots

The crosscap number of a knot in the 3-sphere is defined as the minimal first Betti number of non-orientable surfaces bounded by the knot. In this paper, we determine the crosscap numbers of a large class of pretzel knots. The key ingredient to obtain the result is the algorithm of enumerating all essential surfaces for Montesinos knots developed by Hatcher and Oertel.     

On alternation numbers of links

We construct infinitely many hyperbolic links with x-distance far from the set of (possibly, splittable) alternating links in the concordance class of every link. A sensitive result is given for the concordance class of every (possibly, split) alternating link. Our proof uses an estimate of the τ-distance by an Alexander invariant and the topological imitation theory, both established earlier by the author.     

On the relations of graph parameters and its total parameters

In this paper we get some relations between α（G）, α＇（G）, β（G）, β＇（G） and αT（G）, βT（G）. And all bounds in these relations are best possible, where α（G）, α＇（G）,/3（G）, β（G）, αT（G） and βT（G） are the covering number, edge-covering number, independent number, edge-independent number （or matching number）, total covering number and total independent number, respectively.     

RELAXATION SOLVERS FOR IDEAL MHD EQUATIONS-A REVIEW

We have developed approximate Riemann solvers for ideal MHD equations based on a relaxation approach in [4], [5]. These lead to entropy consistent solutions with good properties like guaranteed positive density. We describe the extension to higher order and multiple space dimensions. Finally we show our implementation of all this into the astrophysics code FLASH.     

On a new 3D model for incompressible euler and navier-stokes equations

In this paper, we investigate some new properties of the incompressible Euler and Navier-Stokes equations by studying a 3D model for axisymmetric 3D incompressible Euler and Navier-Stokes equations with swirl. The 3D model is derived by reformulating the axisymmetric 3D incompressible Euler and Navier-Stokes equations and then neglecting the convection term of the resulting equations. Some properties of this 3D model are reviewed. Finally, some potential features of the incompressible Euler and Navier-Stokes equations such as the stabilizing effect of the convection are presented.     

FINITE ELEMENT METHODS FOR A BI-WAVE EQUATION MODELING D-WAVE SUPERCONDUCTORS

In this paper we develop two conforming finite element methods for a fourth order bi-wave equation arising as a simplified Ginzburg-Landau-type model for d-wave superconductors in absence of applied magnetic field. Unlike the biharmonic operator A2, the bi-wave operator □^2 is not an elliptic operator, so the energy space for the bi-wave equation is much larger than the energy space for the biharmonic equation. This then makes it possible to construct low order conforming finite elements for the bi-wave equation. However, the existence and construction of such finite elements strongly depends on the mesh. In the paper, we first characterize mesh conditions which allow and not allow construction of low order conforming finite elements for approximating the bi-wave equation. We then construct a cubic and a quartic conforming finite element. It is proved that both elements have the desired approximation properties, and give optimal order error estimates in the energy norm, suboptimal （and optimal in some cases） order error estimates in the H1 and L^2 norm. Finally, numerical experiments are presented to guage the efficiency of the proposed finite element methods and to validate the theoretical error bounds.